On pseudosquares and pseudopowers
نویسندگان
چکیده
Introduced by Kraitchik and Lehmer, an x-pseudosquare is a positive integer n ≡ 1 (mod 8) that is a quadratic residue for each odd prime p ≤ x, yet is not a square. We give a subexponential upper bound for the least x-pseudosquare that improves on a bound that is exponential in x due to Schinzel. We also obtain an equi-distribution result for pseudosquares. An x-pseudopower to base g is a positive integer which is not a power of g yet is so modulo p for all primes p ≤ x. It is conjectured by Bach, Lukes, Shallit, and Williams that the least such number is at most exp(agx/ log x) for a suitable constant ag. A bound of exp(agx log log x/ log x) is proved conditionally on the Riemann Hypothesis for Dedekind zeta functions, thus improving on a recent conditional exponential bound of Konyagin and the present authors. We also give a GRH-conditional equidistribution result for pseudopowers that is analogous to our unconditional result for pseudosquares.
منابع مشابه
Pseudopowers and primality proving
The so-called pseudosquares can be employed in very powerful machinery for the primality testing of integers N . In fact, assuming reasonable heuristics (which have been confirmed for numbers to 2) they can be used to provide a deterministic primality test in time O(log N), which some believe to be best possible. In the 1980s D.H. Lehmer posed a question tantamount to whether this could be exte...
متن کاملSome results on pseudosquares
If p is an odd prime, the pseudosquare Lp is defined to be the least positive nonsquare integer such that Lp ≡ 1 (mod 8) and the Legendre symbol (Lp/q) = 1 for all odd primes q ≤ p. In this paper we first discuss the connection between pseudosquares and primality testing. We then describe a new numerical sieving device which was used to extend the table of known pseudosquares up to L271. We als...
متن کاملDoubly-Focused Enumeration of Pseudosquares and Pseudocubes (DRAFT)
This paper offers numerical evidence for a conjecture that primality proving may be done in (logN) operations by examining the growth rate of quantities known as pseudosquares and pseudocubes. In the process, a novel method of solving simultaneous congruences— doubly-focused enumeration— is examined. This technique, first described by D. J. Bernstein, allowed us to obtain record-setting sieve c...
متن کاملThe Pseudosquares Prime Sieve
We present the pseudosquares prime sieve, which finds all primes up to n. Define p to be the smallest prime such that the pseudosquare Lp > n/(π(p)(logn)); here π(x) is the prime counting function. Our algorithm requires only O(π(p)n) arithmetic operations and O(π(p) log n) space. It uses the pseudosquares primality test of Lukes, Patterson, and Williams. Under the assumption of the Extended Ri...
متن کاملResults and estimates on pseudopowers
Let n be a positive integer. We say n looks like a power of 2 modulo a prime p if there exists an integer ep ≥ 0 such that n ≡ 2ep (mod p). First, we provide a simple proof of the fact that a positive integer which looks like a power of 2 modulo all but finitely many primes is in fact a power of 2. Next, we define an x-pseudopower of the base 2 to be a positive integer n that is not a power of ...
متن کامل